From Secrecy to Pride

Secrecy from Resolvability

We analyze physical-layer security based on the premise that the coding mechanism for secrecy over noisy channels is tied to the notion of resolvability. Instead of considering capacity-based constructions, which associate to each message a sub-code that operates just below the capacity of the eavesdropper’s channel, we consider resolvability-based constructions, which associate to each message...

A First DFA on PRIDE: From Theory to Practice

From Secrecy to Soundness: Efficient Verification via Secure Computation

We study the problem of verifiable computation (VC) in which a computationally weak client wishes to delegate the computation of a function f on an input x to a computationally strong but untrusted server. We present new general approaches for constructing VC protocols, as well as solving the related problems of program checking and self-correcting. The new approaches reduce the task of verifia...

An Introduction to Secrecy Capacity

This paper introduces the reader to several information theoretic aspects of covert communications. In particular, it discusses fundamental limits on the amount of information that can be reliably communicated in such a way that a malevolent third-party observer cannot decode the messages. This situation is considered first for a system with a single intended receiver, and then extensions of se...

Secrecy logic: S -secrecy structures

Let S = 〈L, S〉 be a deductive system. An S -secrecy logic is a quadruple K = 〈FmL(V ),K,B, S〉 , where FmL(V ) is the algebra of L-formulas, K,B are S -theories, with B ⊆ K and S ⊆ K such that S ∩ B = ∅ . K corresponds to information deducible from a knowledge base, B to information deducible from the publicly accessible (or browsable) part of the knowledge base and S is a secret set, a set of s...